On the Classical Version of the Branch and Bound Method

In the computer literature, a lot of problems are described that can be called discrete optimization problems: from encrypting information on Internet (including creating programs for digital cryptocurrencies) before searching “interests” groups in social networks. Often, these very difficult to solve computer, hence they “intractable”. More precisely, possible approaches quickly solving (to describe algorithms, program); brute force solution, as rule, is programmed simply, but corresponding program works much slower. Almost every one intractable mathematical model. At same time, both model itself and algorithms designed it often created subject area, also used many other areas. An example such traveling salesman problem. The peculiarity problem that, given relative simplicity its formulation, finding optimal solution (the route). This belongs so-called class NP-complete problems. Moreover, according existing classification, an most complex subclass this class. However, main paper not problem, method soluti- on, i.e. branch bound method. It consists several related heuristics, monographs, multi-heuristic was apparently previously noted: developers should have understood themselves. applied (with minor changes) So, classical version paper, important second subject, formulation. deals with application about application, we use word “classical”. addition classic implementation, consider some new need develop real-time algorithms.